Enumerating Finitary Processes

نویسندگان

  • B. D. Johnson
  • James P. Crutchfield
  • Christopher J. Ellison
  • Carl S. McTague
چکیده

SFI WORKING PAPER: 2010-11-027 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant. ©NOTICE: This working paper is included by permission of the contributing author(s) as a means to ensure timely distribution of the scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the author(s). It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may be reposted only with the explicit permission of the copyright holder. www.santafe.edu

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

“ A Domain Equation for

Abramsky’s seminal article [3] is devoted to a detailed concurrency-theoretic application of the author’s “theory of domains in logical form” programme [4]. One of the main results in [3] is a logical characterization of the finitary bisimulation (cf. Theorem 5.8 on p. 191). (See [5] for a behavioural characterization of the finitary bisimulation.) More precisely, Abramsky shows that two proces...

متن کامل

Primordial Evolution in the Finitary Process Soup

A general and basic model of primordial evolution—a soup of reacting finitary and discrete processes—is employed to identify and analyze fundamental mechanisms that generate and maintain complex structures in prebiotic systems. The processes—ǫ-machines as defined in computational mechanics—and their interaction networks both provide well defined notions of structure. This enables us to quantita...

متن کامل

On Hidden States in Quantum Random Walks

It was recently pointed out that identifiability of quantum random walks and hidden Markov processes underlie the same principles. This analogy immediately raises questions on the existence of hidden states also in quantum random walks and their relationship with earlier debates on hidden states in quantum mechanics. The overarching insight was that not only hidden Markov processes, but also qu...

متن کامل

Computation in Finitary Stochastic and Quantum Processes

We introduce stochastic and quantum finite-state transducers as representations of classical stochastic and quantum finitary processes. Formal process languages serve as the literal representation of the behavior of these processes and are recognized and generated by subclasses of stochastic and quantum transducers. We compare deterministic and nondeterministic stochastic and quantum automata, ...

متن کامل

Scalar Outcomes Suffice for Finitary Probabilistic Testing

The question of equivalence has long vexed research in concurrency, leading to many different denotationaland bisimulation-based approaches; a breakthrough occurred with the insight that tests expressed within the concurrent framework itself, based on a special “success action”, yield equivalences that make only inarguable distinctions. When probability was added, however, it seemed necessary t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1011.0036  شماره 

صفحات  -

تاریخ انتشار 2010